Goto

Collaborating Authors

 local representation


NegoCollab: ACommon Representation Negotiation Approach for Heterogeneous Collaborative Perception

Neural Information Processing Systems

Collaborative perception improves task performance by expanding the perception range through information sharing among agents. Immutable heterogeneity poses a significant challenge in collaborative perception, as participating agents may employ different and fixed perception models. This leads to domain gaps in the intermediate features shared among agents, consequently degrading collaborative performance. Aligning the features of all agents to a common representation can eliminate domain gaps with low training cost. However, in existing methods, the common representation is designated as the representation of a specific agent, making it difficult for agents with significant domain discrepancies from this specific agent to achieve proper alignment.


NegoCollab: A Common Representation Negotiation Approach for Heterogeneous Collaborative Perception

Neural Information Processing Systems

Collaborative perception improves task performance by expanding the perception range through information sharing among agents. Immutable heterogeneity poses a significant challenge in collaborative perception, as participating agents may employ different and fixed perception models. This leads to domain gaps in the intermediate features shared among agents, consequently degrading collaborative performance. Aligning the features of all agents to a common representation can eliminate domain gaps with low training cost. However, in existing methods, the common representation is designated as the representation of a specific agent, making it difficult for agents with significant domain discrepancies from this specific agent to achieve proper alignment.


Symbolic Graph Reasoning Meets Convolutions

Neural Information Processing Systems

Beyond local convolution networks, we explore how to harness various external human knowledge for endowing the networks with the capability of semantic global reasoning.


Symbolic Graph Reasoning Meets Convolutions

Neural Information Processing Systems

Beyond local convolution networks, we explore how to harness various external human knowledge for endowing the networks with the capability of semantic global reasoning.


Supplementary

Neural Information Processing Systems

Federated Fair Model Training The detailed workflow of our FairVFL method is summarized in Algorithm 1. Algorithm 1 Federated Model Training in FairVFL Next, we will introduce the basic models used for model training in details. Next, we will analyze the influence of the weights of adversarial learning on model fairness. We summarize results in Figure 1 and have several observations.


Sparsification and Reconstruction from the Perspective of Representation Geometry

arXiv.org Artificial Intelligence

Sparse Autoencoders (SAEs) have emerged as a predominant tool in mechanistic interpretability, aiming to identify interpretable monosemantic features. However, how does sparse encoding organize the representations of activation vector from language models? What is the relationship between this organizational paradigm and feature disentanglement as well as reconstruction performance? To address these questions, we propose the SAEMA, which validates the stratified structure of the representation by observing the variability of the rank of the symmetric semipositive definite (SSPD) matrix corresponding to the modal tensor unfolded along the latent tensor with the level of noise added to the residual stream. To systematically investigate how sparse encoding alters representational structures, we define local and global representations, demonstrating that they amplify inter-feature distinctions by merging similar semantic features and introducing additional dimensionality. Furthermore, we intervene the global representation from an optimization perspective, proving a significant causal relationship between their separability and the reconstruction performance. This study explains the principles of sparsity from the perspective of representational geometry and demonstrates the impact of changes in representational structure on reconstruction performance. Particularly emphasizes the necessity of understanding representations and incorporating representational constraints, providing empirical references for developing new interpretable tools and improving SAEs. The code is available at \hyperlink{https://github.com/wenjie1835/SAERepGeo}{https://github.com/wenjie1835/SAERepGeo}.


Towards Robust Multimodal Representation: A Unified Approach with Adaptive Experts and Alignment

arXiv.org Artificial Intelligence

Healthcare relies on multiple types of data, such as medical images, genetic information, and clinical records, to improve diagnosis and treatment. However, missing data is a common challenge due to privacy restrictions, cost, and technical issues, making many existing multi-modal models unreliable. To address this, we propose a new multi-model model called Mixture of Experts, Symmetric Aligning, and Reconstruction (MoSARe), a deep learning framework that handles incomplete multimodal data while maintaining high accuracy. MoSARe integrates expert selection, cross-modal attention, and contrastive learning to improve feature representation and decision-making. Our results show that MoSARe outperforms existing models in situations when the data is complete. Furthermore, it provides reliable predictions even when some data are missing. This makes it especially useful in real-world healthcare settings, including resource-limited environments. Our code is publicly available at https://github.com/NazaninMn/MoSARe.


Seeing the Whole in the Parts in Self-Supervised Representation Learning

arXiv.org Artificial Intelligence

Here, we propose a new way to model spatial co-occurrences by aligning local representations (before pooling) with a global image representation. We present CO-SSL, a family of instance discrimination methods and show that it outperforms previous methods on several datasets, including ImageNet-1K where it achieves 71.5% of Top-1 accuracy with 100 pre-training epochs. CO-SSL is also more robust to noise corruption, internal corruption, small adversarial attacks, and large training crop sizes. Our analysis further indicates that CO-SSL learns highly redundant local representations, which offers an explanation for its robustness. Overall, our work suggests that aligning local and global representations may be a powerful principle of unsupervised category learning. Recent self-supervised learning (SSL) approaches learn visual representations that perform well on diverse downstream tasks, including object categorization. These methods include instance discrimination (ID) (Chen et al., 2020a) and masked modeling (MM) (He et al., 2022; Bao et al., 2021) approaches. While ID methods train representations to be invariant over different small crops of augmented images, MM uses a partially masked image to predict the masked information. Existing analyses suggest that the best configurations involve discarding most of the information from the images (Tian et al., 2021; He et al., 2022; Assran et al., 2023). For instance, if there is an elephant trunk, the method may learn that there is likely also an elephant tusk in the image, and vice versa. Intuitively, this makes category recognition (an elephant) less sensitive to the exact visual features (trunk or tusk) present in an image. Spatial statistical learning is also a fundamental aspect of biological vision. A classic study investigated the ability of humans to extract spatial co-occurrences among features (Fiser & Aslin, 2001).


CAREL: Instruction-guided reinforcement learning with cross-modal auxiliary objectives

arXiv.org Artificial Intelligence

Grounding the instruction in the environment is a key step in solving language-guided goal-reaching reinforcement learning problems. In automated reinforcement learning, a key concern is to enhance the model's ability to generalize across various tasks and environments. In goal-reaching scenarios, the agent must comprehend the different parts of the instructions within the environmental context in order to complete the overall task successfully. In this work, we propose CAREL (Cross-modal Auxiliary REinforcement Learning) as a new framework to solve this problem using auxiliary loss functions inspired by video-text retrieval literature and a novel method called instruction tracking, which automatically keeps track of progress in an environment. The results of our experiments suggest superior sample efficiency and systematic generalization for this framework in multi-modal reinforcement learning problems. Our code base is available here.


LaB-CL: Localized and Balanced Contrastive Learning for improving parking slot detection

arXiv.org Artificial Intelligence

Parking slot detection is an essential technology in autonomous parking systems. In general, the classification problem of parking slot detection consists of two tasks, a task determining whether localized candidates are junctions of parking slots or not, and the other that identifies a shape of detected junctions. Both classification tasks can easily face biased learning toward the majority class, degrading classification performances. Yet, the data imbalance issue has been overlooked in parking slot detection. We propose the first supervised contrastive learning framework for parking slot detection, Localized and Balanced Contrastive Learning for improving parking slot detection (LaB-CL). The proposed LaB-CL framework uses two main approaches. First, we propose to include class prototypes to consider representations from all classes in every mini batch, from the local perspective. Second, we propose a new hard negative sampling scheme that selects local representations with high prediction error. Experiments with the benchmark dataset demonstrate that the proposed LaB-CL framework can outperform existing parking slot detection methods.